// Copyright (C) 2008 Taylor L. Riche <riche@cs.utexas.edu>
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//

#ifndef COREOP_H_
#define COREOP_H_

#include <map>
#include <queue>
#include <utility>
#include <string>
#include <vector>

namespace lagniappe
{

class RCon;

class CoreOp
{
protected:
        // TLR: OPT
	//std::map<std::string, std::pair<CoreOp *, std::string> * > destMap;
        std::vector<std::pair<CoreOp *, uint32_t> *> destVec;
public:
	CoreOp();
	virtual ~CoreOp();
	virtual void processRequest(RCon* rcon) = 0;
        // TLR: OPT
	//virtual bool pred(std::string port) {return true;}
        virtual bool pred(uint32_t port) {return true;}
	virtual void run(RCon * rcon) = 0;
	virtual void run(std::queue<RCon *> * rconQueue) = 0;
        // TLR: OPT
	//void setDestination(std::string s, std::pair<CoreOp *, std::string> * p);
	void setDestination(uint32_t i, std::pair<CoreOp *, uint32_t> * p);
	virtual unsigned int getQueueThreshold() {return 0xFFFFFFFF;}
	virtual void list() {}
};

}

#endif /*COREOP_H_*/
